Quantum query complexity of subgraph containment with constant-sized certificates
نویسنده
چکیده
We study the quantum query complexity of constant-sized subgraph containment. Such problems include determining whether a n-vertex graph contains a triangle, clique or star of some size. For a general subgraph H with k vertices, we show that H containment can be solved with quantum query complexity O (
منابع مشابه
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs
Quantum query complexity is a model of quantum computation, in which the cost of computing a function is measured by the number of queries that are made to the input given as a black-box. In this model, it was exhibited in the early stage of quantum computing research that there exist quantum algorithms superior to the classical counterparts, such as Deutsch and Jozsa’s algorithm, Simon and Sho...
متن کاملThe quantum query complexity of certification
We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced nand formula. We show that the query complexity is Θ̃(d) for 0-certificates, and Θ̃(d) for 1-certificates. In particular, this shows that the zero-error quantum query complexity of evaluating such formulas is Õ(d). Our lower bound relies on the fact that the quantum adversary method obeys a direct sum...
متن کاملQuantum Algorithms and Lower Bounds for Independent Set and Subgraph Isomorphism Problem
The study of the quantum query complexity for some graph problems is an interesting area in quantum computing. Only for a few graph problems there are quantum algorithms and lower bounds known. We present some new quantum query and quantum time algorithms and quantum query complexity bounds for the maximal and maximum independent set problem and the graph and subgraph isomorphism problem.
متن کاملGraph Indexing: Tree + Delta >= Graph
Recent scientific and technological advances have witnessed an abundance of structural patterns modeled as graphs. As a result, it is of special interest to process graph containment queries effectively on large graph databases. Given a graph database G, and a query graph q, the graph containment query is to retrieve all graphs in G which contain q as subgraph(s). Due to the vast number of grap...
متن کاملQuantum Query Complexity of Subgraph Isomorphism and Homomorphism
Let H be a fixed graph on n vertices. Let fH(G) = 1 iff the input graph G on n vertices contains H as a (not necessarily induced) subgraph. Let αH denote the cardinality of a maximum independent set of H. In this paper we show: Q(fH) = Ω ( √ αH · n) , where Q(fH) denotes the quantum query complexity of fH . As a consequence we obtain a lower bounds for Q(fH) in terms of several other parameters...
متن کامل